A novel electronic cash system with trustee-based anonymity revocation from pairing
نویسندگان
چکیده
1567-4223/$ see front matter 2011 Elsevier B.V. A doi:10.1016/j.elerap.2011.06.002 ⇑ Corresponding author. Tel.: +886 5 2721001; fax: E-mail address: [email protected] (J.-S. Cho 1 A typical e-cash withdrawal protocol requires a pr so it can ensure that the bank and customer have mutu e-cash withdrawal. Untraceable electronic cash is an attractive payment tool for electronic-commerce because its anonymity property can ensure the privacy of payers. However, this anonymity property is easily abused by criminals. In this paper, several recent untraceable e-cash systems are examined. Most of these provide identity revealing only when the e-cash is double spent. Only two of these systems can disclose the identity whenever there is a need, and only these two systems can prevent crime. We propose a novel e-cash system based on identity-based bilinear pairing to create an anonymity revocation function. We construct an identity-based blind signature scheme, in which a bank can blindly sign on a message containing a trustee-approved token that includes the user’s identity. On demand, the trustee can disclose the identity for e-cash using only one symmetric operation. Our scheme is the first attempt to incorporate mutual authentication and key agreement into e-cash protocols. This allows the proposed system to attain improvement in communication efficiency when compared to previous works. 2011 Elsevier B.V. All rights reserved.
منابع مشابه
A New type of "Magic Ink" Signatures - Towards Transcript-Irrelevant Anonymity Revocation
The magic ink signature recently proposed in [11] is a blind signature which allows “unblinding” of a signature by authorities to establish what is known as audit trail and anonymity revocation in case of criminal activities. In [11] as well as in all the previous fair blind signature schemes (e. g., [2] and [10]), trustees need to search a database maintained by signers to obtain a transcript ...
متن کاملBlind Certification of Public Keys and Efficiently Revocable Cash: Secure Against Capable Attackers
Electronic cash should be revocable in order to nullify the effect of attacks mounted by a capable attacker (e.g., double spending by reverse-engineering tamper-resistant devices). For prudent engineering considerations, cash revocability forms a necessary complementary measure to using tamper-resistant devices, adding system security while lowering system cost by reducing the level of physical...
متن کاملAnonymity Control in E-Cash Systems
Abstrac t . Electronic cash, and other cryptographic payment systems, offer a level of user anonymity during a purchase, in order to emulate electronically the properties of physical cash exchange. However, it has been noted that there are crime-prevention situations where anonymity of notes is undesirable; in addition there may be regulatory and legal constraints limiting anonymous transfer of...
متن کاملAn Efficient Off-line Electronic Cash System with Revocable Anonymity
Numerous anonymity revocation mechanisms have been proposed for off-line e-cash system in the last decade. Within this category of payment systems, two primary considerations are double-spending detection and tracing capability. However, most designs and existing solutions for these two basic requirements are inefficient or impractical. In this paper, an efficient e-cash with anonymity revocati...
متن کاملAuditable Envelopes: Tracking Anonymity Revocation Using Trusted Computing
In this paper, we discuss a protocol allowing the remote user of a system providing revocable anonymity to be assured of whether or not her anonymity is revoked. We achieve this via a novel use of Trusted Computing and Virtual Monotonic Counters. The protocol has wideranging scope in a variety of computer security fields, such as electronic cash, fair exchange and electronic voting.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Commerce Research and Applications
دوره 10 شماره
صفحات -
تاریخ انتشار 2011